Effective Set Membership in Computer Algebra and Beyond

نویسنده

  • James H. Davenport
چکیده

In previous work, we showed the importance of distinguishing “I know that X = Y ” from “I don’t know that X = Y ”. In this paper we look at effective set membership, starting with Gröbner bases, where the issues are well-expressed in algebra systems, and going on to integration and other questions of ‘computer calculus’. In particular, we claim that a better recognition of the role of set membership would clarify some features of computer algebra systems, such as ‘what does an integral mean as output’.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new algorithm for computing SAGBI bases up to an arbitrary degree

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.

متن کامل

An algorithm for determining common weights by concept of membership function

Data envelopment analysis (DEA) is a method to evaluate the relative efficiency of decision making units (DMUs). In this method, the issue has always been to determine a set of weights for each DMU which often caused many problems. Since the DEA models also have the multi-objective linear programming (MOLP) problems nature, a rational relationship can be established between MOLP and DEA problem...

متن کامل

Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining

The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...

متن کامل

Lattice of full soft Lie algebra

In ‎this ‎paper, ‎we ‎study ‎the ‎relation ‎between ‎the ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎with ‎the ‎lattice theory. ‎We ‎introduce ‎the ‎concepts ‎of ‎the ‎lattice ‎of ‎soft ‎sets, ‎full ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎and next, we ‎verify ‎some ‎properties ‎of ‎them. We ‎prove ‎that ‎the ‎lattice ‎of ‎the ‎soft ‎sets ‎on ‎a fixed parameter set is isomorphic to the power set of a ...

متن کامل

Metasets: A New Approach to Partial Membership

Metaset is a new concept of set with partial membership relation. It is designed to represent and process vague, imprecise data – similarly to fuzzy sets. Metasets are based on the classical set theory primitive notions. At the same time they are directed towards efficient computer implementations and applications. The degrees of membership for metasets are expressed as finite binary sequences,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008